Scheduling real-time garbage collection on uniprocessors
نویسندگان
چکیده
منابع مشابه
A Scheduling Real-time Garbage Collection on Uni-Processors
Managed languages such as Java and C# are increasingly being considered for real-time applications. From both technical and scientific standpoints the most interesting challenge this presents is how to reconcile efficiency and predictability in the memory management subsystem of these languages. To relieve programmers from having to deal with deallocation of data structures and to eradicate mem...
متن کاملGarbage Collection Scheduling for Utility Accrual Real-Time Systems
Utility Accrual (UA) scheduling is a method of dynamic real-time scheduling that is designed to respond to overload conditions by producing a feasible schedule that heuristically maximizes a pre-defined metric of utility. Whereas utility accrual schedulers have traditionally focused on CPU overload, this dissertation explores memory overload conditions during which the aggregate memory demand e...
متن کاملJoint garbage collection and hard real-time scheduling
We analyze the integration of automatic memory management in a real-time context. We focus on integrating a real-time (copying) garbage collector with hard real-time static-priority periodic tasks. This integration is done by considering the copying collector as an aperiodic task served by a polling server. We analyze the schedulability of this system for any polling server parameters. This ana...
متن کاملReal-Time Compacting Garbage Collection
1. Introduction Traditional batch garbage collection techniques lead to long delays in the programming execution. Different methods to reduce the delays have been suggested. These methods can be divided into two classes: those intended to give acceptable pauses in interactive programs (programs that interact with a user), and those intended for real-time programs. In an interactive program, it ...
متن کاملGarbage Collection for Hard Real-Time Systems
This paper describes a scheme for garbage collection suitable for hard real-time applications. The approach supports both periodic high-priority processes and low-priority processes. Garbage collection work is done exclusively during execution of low-priority processes. A prototype garbage collector has been implemented for a C++ real-time kernel. The results confirms that high-priority process...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computer Systems
سال: 2011
ISSN: 0734-2071,1557-7333
DOI: 10.1145/2003690.2003692